Enhanced Adjacency Matrix-Based Lightweight Graph Convolution Network for Action Recognition

نویسندگان

چکیده

Graph convolutional networks (GCNs), which extend neural (CNNs) to non-Euclidean structures, have been utilized promote skeleton-based human action recognition research and made substantial progress in doing so. However, there are still some challenges the construction of models based on GCNs. In this paper, we propose an enhanced adjacency matrix-based graph network with a combinatorial attention mechanism (CA-EAMGCN) for recognition. Firstly, matrix is constructed expand model’s perceptive field global node features. Secondly, feature selection fusion module (FSFM) designed provide optimal ratio multiple input features model. Finally, devised. Specifically, our spatial-temporal (ST) limb (LAM) integrated into multi-input branch mainstream proposed model, respectively. Extensive experiments three large-scale datasets, namely NTU RGB+D 60, 120 UAV-Human show that model takes account both requirements light weight accuracy. This demonstrates effectiveness method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spatio-Temporal Graph Convolution for Skeleton Based Action Recognition

Variations of human body skeletons may be considered as dynamic graphs, which are generic data representation for numerous real-world applications. In this paper, we propose a spatio-temporal graph convolution (STGC) approach for assembling the successes of local convolutional filtering and sequence learning ability of autoregressive moving average. To encode dynamic graphs, the constructed mul...

متن کامل

Adjacency Matrix based Face Recognition Approach

Biometric based techniques have emerged as the most promising option for recognizing individuals in recent years, for authenticating people and granting them access. Face recognition provide a biometric based authentication, authorization, surveillance services. Face recognition has gained increasing interest in the recent decade. Over the years there have been several techniques being develope...

متن کامل

Graph Matching using Adjacency Matrix Markov Chains

This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probability matrix of a Markov chain. The nodeorder of the steady state random walk associated with this Markov chain is determined by the co-efficent order of the leading eigenvector of the adjacency matrix. We match nodes in ...

متن کامل

The Adjacency Matrix and Graph Coloring

These notes are not necessarily an accurate representation of what happened in class. The notes written before class say what I think I should say. I sometimes edit the notes after class to make them way what I wish I had said. There may be small mistakes, so I recommend that you check any mathematically precise statement before using it in your own work. These notes were last revised on Septem...

متن کامل

Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication

Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In this paper we show that some well-known Web and social graph compression formats are computation-friendly, in the sense that they allow boosting the computation. In particular, we show t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sensors

سال: 2023

ISSN: ['1424-8220']

DOI: https://doi.org/10.3390/s23146397